A fast voxelization algorithm for trilinearly interpolated isosurfaces

A Smart Voxelization Algorithm

In this paper we present a real-time voxelization algorithm which is implemented with newest programmable graphics hardware. The algorithm first converts geometric model into discrete voxel space. The resultant voxels are then encoded as 2D textures and stored in three intermediate sheet buffers called directional sheet buffers according the orientation of the boundary surface. These buffers ar...

A Topology-Preserving Voxelization Shrinking Algorithm

Recognition of 3-dimensional objects with complex internal geometries relies more heavily on topology than external shape. We discuss a novel voxelization rescaling algorithm intended to preserve topological structure even at low resolutions, appropriate for artistic reproductions of complex geometries. Introduction: Voxels and Motivations Voxels are the 3-dimensional analog of pixels; a filled...

Fast Multiresolution Extraction of Multiple Transparent Isosurfaces

In this paper, we present a multiresolution algorithm which is capable to render multiple transparent isosurfaces under real–time constraints. To this end, the underlying 3D data set is covered with a hierarchical tetrahedral grid. The multiresolution extraction algorithm is then based on an adaptive traversal of the tetrahedral grid with the help of error indicators. The display of transparent...

A New Fast Data Encryption Algorithm (FDE)

"Skeleton climbing": fast isosurfaces with fewer triangles

Skeleton Climbing is an algorithm that builds triangulated isosurfaces in 3D grid data, more economically than Marching Cubes, and without the time penalty of current mesh decimation algorithms. Building the surface from its intersections with grid edges (1-skeleton), then faces (2-skeleton), then cubes (3-skeleton), treats the data in a uniform way; this allows a 25% reduction in the number of...